EPCBC - A Block Cipher Suitable for Electronic Product Code Encryption
نویسندگان
چکیده
In this paper, we present EPCBC, a lightweight cipher that has 96-bit key size and 48-bit/96-bit block size. This is suitable for Electronic Product Code (EPC) encryption, which uses low-cost passive RFID-tags and exactly 96 bits as a unique identifier on the item level. EPCBC is based on a generalized PRESENT with block size 48 and 96 bits for the main cipher structure and customized key schedule design which provides strong protection against related-key differential attacks, a recent class of powerful attacks on AES. Related-key attacks are especially relevant when a block cipher is used as a hash function. In the course of proving the security of EPCBC, we could leverage on the extensive security analyses of PRESENT, but we also obtain new results on the differential and linear cryptanalysis bounds for the generalized PRESENT when the block size is less than 64 bits, and much tighter bounds otherwise. Further, we analyze the resistance of EPCBC against integral cryptanalysis, statistical saturation attack, slide attack, algebraic attack and the latest higher-order differential cryptanalysis from FSE 2011 [11]. Our proposed cipher would be the most efficient at EPC encryption, since for other ciphers such as AES and PRESENT, it is necessary to encrypt 128-bit blocks (which results in a 33% overhead being incurred). The efficiency of our proposal therefore leads to huge market implications. Another contribution is an optimized implementation of PRESENT that is smaller and faster than previously published results.
منابع مشابه
Word-Based AES Encryption Without Data Expansion
Generally, AES is typical encryption algorithm to support the security service of any mobile applications. However, AES cannot encrypt the short sensory data of partial block without data expansion, which is often in the mobile sensing application environments. In this paper, a word-based AES cipher, AESw, is proposed by modifying the AES to make it fit for encrypting the arbitrary message in 3...
متن کاملAlgebraic methods in analyzing lightweight cryptographic symmetric primitives
In this work we analyze two lightweight cryptographic primitives, the hash function SPONGENT and the block cipher EPCBC, using algebraic methods. Regarding SPONGENT, we are able to improve on previously known results by finding two semi-free-start collisions for round-reduced SPONGENT-88 with 6 rounds, and prove that no semifree-start collisions exist for SPONGENT-128 with 6 rounds. For EPCBC w...
متن کاملAdvanced Encryption Standard (AES) in Counter Mode
The Advanced Encryption Standard (AES), also known as Rijndael is a block cipher. The National Institute of Standards and Technology (NIST) has defined five modes of operation for AES. Each of these modes has different characteristics. The five modes are: Electronic Code Book (ECB), Cipher Block Chaining (CBC), Cipher FeedBack (CFB), Output FeedBack (OFB), and Counter (CTR). Only AES Counter mo...
متن کاملOptimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC. Using our optimized guessing strategy we are able to attack 5 rounds of EPCBC96 and 8 rounds of EPCBC-48 faster than brute force using one and two known plaintexts resp. Finally, we are able to identify a class of weak ...
متن کاملMore on linear hulls of PRESENT-like ciphers and a cryptanalysis of full-round EPCBC-96
In this paper we investigate the linear hull effect in the light-weight block cipher EPCBC. We give an efficient method of computing linear hulls with high capacity. We then apply found hulls to derive attacks on the full 32 rounds of EPCBC–96 and 20 rounds of EPCBC–48. Using the developed methods we revise the work of J.Y. Cho from 2010 and obtain an attack based on multidimensional linear app...
متن کامل